Martin's axiom and D21 well-ordering of the reals
نویسندگان
چکیده
Assuming an inaccessible cardinal κ, there is a generic extension in which MA+ 20 = κ holds and the reals have a ∆1 well-ordering.
منابع مشابه
A rigorous procedure for generating a well-ordered Set of Reals without use of Axiom of Choice / Well-Ordering Theorem
Well-ordering of the Reals presents a major challenge in Set theory. Under the standard Zermelo Fraenkel Set theory (ZF) with the Axiom of Choice (ZFC), a well-ordering of the Reals is indeed possible. However the Axiom of Choice (AC) had to be introduced to the original ZF theory which is then shown equivalent to the well-ordering theorem. Despite the result however, no way has still been foun...
متن کاملA Class of Consistent Anti-martin’s Axioms
Both the Continuum Hypothesis and Martin's Axiom allow induc-tive constructions to continue in circumstances where the inductive hypothesis might otherwise fail. The search for useful related axioms procedes naturally in two directions: towards "Super Martin's Axioms ," which extend MA to broader classes of orders; and towards "Anti-Martin's Axioms" (AMA's) which are strictly weaker than CH, bu...
متن کاملBounded Proper Forcing Axiom and Well Orderings of the Reals
We show that the bounded proper forcing axiom BPFA implies that there is a well-ordering of P(ω1) which is ∆1 definable with parameter a subset of ω1. Our proof shows that if BPFA holds then any inner model of the universe of sets that correctly computes א2 and also satisfies BPFA must contain all subsets of ω1. We show as applications how to build minimal models of BPFA and that BPFA implies t...
متن کاملProper forcing, cardinal arithmetic, and uncountable linear orders
In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2),∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, ω∗ 1 , C, C ∗ where X is any suborder of the reals of size ...
متن کاملSubcomplete Forcing and L-Forcing
ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are closed under countable support iterations. The latter is closed under revised countable support iterations subject to certain standard restraints. These theorems have been heavily used in modern set th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 35 شماره
صفحات -
تاریخ انتشار 1996